Henning Buddenbaum < Henning Fernau < Henning Kelbaek

Facettes :

List of bibliographic references indexed by Henning Fernau

Number of relevant bibliographic references: 43.
[20-40] [0 - 20][0 - 43][40-42][40-60]

Ident.	Authors (with country if any)	Title
000E18 (2009)	Gábor Erdélyi [Allemagne] ; Henning Fernau [Allemagne] ; Judy Goldsmith [États-Unis] ; Nicholas Mattei [États-Unis] ; Daniel Raible [Allemagne] ; Jörg Rothe [Allemagne]	The Complexity of Probabilistic Lobbying
000E52 (2009)	Henning Fernau [Allemagne] ; Daniel Raible [Allemagne]	Searching Trees: An Essay
000F12 (2009)	Henning Fernau [Allemagne] ; Joachim Kneis [Allemagne] ; Dieter Kratsch [France] ; Alexander Langer [Allemagne] ; Mathieu Liedloff [France] ; Daniel Raible [Allemagne] ; Peter Rossmanith [Allemagne]	An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
000F70 (2009)	J. M. Sigarreta [Mexique] ; S. Bermudo [Espagne] ; Henning Fernau [Allemagne]	On the complement graph and defensive k-alliances
000F71 (2009)	Henning Fernau [Allemagne] ; Juan A. Rodriguez [Espagne] ; José M. Sigarreta [Mexique]	Offensive r-alliances in graphs
001021 (2009)	Henning Fernau [Allemagne]	Algorithms for learning regular expressions from positive data
001023 (2009)	Henning Fernau [Allemagne] ; Daniel Raible [Allemagne]	A parameterized perspective on packing paths of length two
001122 (2008)	Daniel Raible [Allemagne] ; Henning Fernau [Allemagne]	Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees
001148 (2008)	Michael Fellows [Australie] ; Henning Fernau [Australie, Allemagne]	Facility Location Problems: A Parameterized View
001149 (2008)	Henning Fernau [Allemagne] ; Daniel Raible [Allemagne]	Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
001163 (2008)	Guoqiang Bai [Allemagne] ; Henning Fernau [Allemagne]	Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
001174 (2008)	Henning Fernau [Allemagne] ; Daniel Raible [Allemagne]	A Parameterized Perspective on Packing Paths of Length Two
001175 (2008)	Daniel Raible [Allemagne] ; Henning Fernau [Allemagne]	A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
001209 (2008)	Henning Fernau [Allemagne]	Parameterized algorithmics for linear arrangement problems
001210 (2008)	JIANER CHEN [États-Unis] ; Henning Fernau [Allemagne] ; Iyad A. Kanj [États-Unis] ; GE XIA [États-Unis]	PARAMETRIC DUALITY AND KERNELIZATION : LOWER BOUNDS AND UPPER BOUNDS ON KERNEL SIZE
001250 (2008)	Jürgen Dassow [Allemagne] ; Henning Fernau [Allemagne]	Comparison of some descriptional complexities of 0L systems obtained by a unifying approach
001261 (2008)	Henning Fernau [Allemagne] ; Joe F. Ryan [Australie] ; Kiki A. Sugeng [Australie]	A sum labelling for the generalised friendship graph
001395 (2007)	Henning Fernau [Allemagne]	LEARNING TREE LANGUAGES FROM TEXT
001402 (2007)	Henning Fernau [Allemagne] ; Klaus Reinhardt [Allemagne] ; Ludwig Staiger [Allemagne]	Decidability of code properties
001457 (2006)	Henning Fernau [Allemagne]	edge dominating set : Efficient Enumeration-Based Exact Algorithms
001477 (2006)	Henning Fernau [Allemagne, Royaume-Uni]	Parameterized Algorithms for Hitting Set : The Weighted Case

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Author.i -k "Henning Fernau" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Author.i  \
                -Sk "Henning Fernau" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    Author.i
   |clé=    Henning Fernau
}}

---

This area was generated with Dilib version V0.6.31. Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024